On the Connections of Generalized Entropies With Shannon and Kolmogorov-Sinai Entropies
نویسنده
چکیده
We consider the concept of generalized Kolmogorov–Sinai entropy, where instead of the Shannon entropy function, we consider an arbitrary concave function defined on the unit interval, vanishing in the origin. Under mild assumptions on this function, we show that this isomorphism invariant is linearly dependent on the Kolmogorov–Sinai entropy.
منابع مشابه
Entropy of infinite systems and transformations
The Kolmogorov-Sinai entropy is a far reaching dynamical generalization of Shannon entropy of information systems. This entropy works perfectly for probability measure preserving (p.m.p.) transformations. However, it is not useful when there is no finite invariant measure. There are certain successful extensions of the notion of entropy to infinite measure spaces, or transformations with ...
متن کاملInequalities for Shannon entropies and Kolmogorov complexities
The paper investigates connections between linear inequalities that are valid for Shannon entropies and for Kolmogorov complexities.
متن کاملEntropy of Fuzzy Partitions and Entropy of Fuzzy Dynamical Systems
In the paper we define three kinds of entropy of a fuzzy dynamical system using different entropies of fuzzy partitions. It is shown that different definitions of the entropy of fuzzy partitions lead to different notions of entropies of fuzzy dynamical systems. The relationships between these entropies are studied and connections with the classical case are mentioned as well. Finally, an analog...
متن کاملA Preferred Definition of Conditional Rényi Entropy
The Rényi entropy is a generalization of Shannon entropy to a one-parameter family of entropies. Tsallis entropy too is a generalization of Shannon entropy. The measure for Tsallis entropy is non-logarithmic. After the introduction of Shannon entropy , the conditional Shannon entropy was derived and its properties became known. Also, for Tsallis entropy, the conditional entropy was introduced a...
متن کاملHow well do practical information measures estimate the Shannon entropy?
Estimating the entropy of finite strings has applications in areas such as event detection, similarity measurement or in the performance assessment of compression algorithms. This report compares a variety of computable information measures for finite strings that may be used in entropy estimation. These include Shannon’s n-block entropy, the three variants of the Lempel-Ziv production complexi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Entropy
دوره 16 شماره
صفحات -
تاریخ انتشار 2014